Projective dimension and Brown-Peterson homology
نویسندگان
چکیده
منابع مشابه
Projective dimension, graph domination parameters, and independence complex homology
We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs. In particular, we draw heavily from the topic of dominating sets. Through Hochster’s Formula, we recover and strengthen existing results on the homological connectivity of graph independence complexes.
متن کاملUnstable splittings related to Brown-Peterson cohomology
We give a new and relatively easy proof of the splitting theorem of the second author for the spaces in the Omega spectrum for BP . We then give the first published proofs of our similar theorems for the spectra P (n).
متن کاملSchubert Calculus and the Homology of the Peterson Variety
We use the tight correlation between the geometry of the Peterson variety and the combinatorics the symmetric group to prove that homology of the Peterson variety injects into the homology of the flag variety. Our proof counts the points of intersection between certain Schubert varieties in the full flag variety and the Peterson variety, and shows that these intersections are proper and transve...
متن کاملFinite Flat and Projective Dimension
known as the left big finitistic projective dimension of A, is finite. Here pdM denotes the projective dimension of M . Unfortunately, this number is not known to be finite even if A is a finite dimensional algebra over a field, where, indeed, its finiteness is a celebrated conjecture. On the other hand, for such an algebra, finite flat certainly implies finite projective dimension, simply beca...
متن کاملBounding Projective Dimension
The use of algorithms in algebra as well as the study of their complexity was initiated before the advent of modern computers. Hermann [25] studied the ideal membership problem, i.e determining whether a given polynomial is in a fixed homogeneous ideal, and found a doubly exponential bound on its computational complexity. Later Mayr and Meyer [31] found examples which show that her bound was ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1973
ISSN: 0040-9383
DOI: 10.1016/0040-9383(73)90027-x